Viewing Implicit Social Networks As Bipartite Graphs

نویسنده

  • Benjamin Bercovitz
چکیده

In this paper, we describe a new model for thinking about implicit social networks, which are defined when users interact by modifying a common shared object. These are also called "knowledge sharing" networks and are in contrast to the typical person-to-person social networks. The properties of these networks are important to many data mining applications including recommendation systems, personalization, and other networks. The model consists of a bipartite graph where users and interaction points are two classes of nodes, connected by edges when the users interact with the shared objects represented by the interaction points. For example, an interaction point for an online book store might be the reviews for a certain book. In the end, we conclude that the information in the network structure of the bipartite graph contains significant useful information on the implicit social network and can be used as an effective data structure for analysis and visualization.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Bipartite Graphs as Models of Population Structures in Evolutionary Multiplayer Games

By combining evolutionary game theory and graph theory, "games on graphs" study the evolutionary dynamics of frequency-dependent selection in population structures modeled as geographical or social networks. Networks are usually represented by means of unipartite graphs, and social interactions by two-person games such as the famous prisoner's dilemma. Unipartite graphs have also been used for ...

متن کامل

Scaling Collaborative Filtering to Large-Scale Bipartite Rating Graphs Using Lenskit and Spark

Popular social networking applications such as Facebook, Twitter, Friendster, etc. generate very large graphs with different characteristics. These social networks are huge, comprising millions of nodes and edges that push existing graph mining algorithms and architectures to their limits. In product-rating graphs, users connect with each other and rate items in tandem. In such bipartite graphs...

متن کامل

Small Worlds Among Interlocking Directors: Network Structure and Distance in Bipartite Graphs

We describe a methodology to examine bipartite relational data structures as exemplified in networks of corporate interlocking. These structures can be represented as bipartite graphs of directors and companies, but direct comparison of empirical datasets is often problematic because graphs have different numbers of nodes and different densities. We compare empirical bipartite graphs to simulat...

متن کامل

Power-law node degree distribution in online affiliation networks

The purpose of this article is to present a preferential attachment model adjusted to generation of bipartite graphs. The original model is able to produce unipartite graphs with node degree distribution following power law relation. The motivation for extending classic model is the fact that multi-partite graph topologies are becoming more and more popular in social networks. This phenomenon r...

متن کامل

Two classes of bipartite networks: nested biological and social systems.

Bipartite graphs have received some attention in the study of social networks and of biological mutualistic systems. A generalization of a previous model is presented, that evolves the topology of the graph in order to optimally account for a given contact preference rule between the two guilds of the network. As a result, social and biological graphs are classified as belonging to two clearly ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009